混合整数凸面和非线性程序MICP和MINLP具有表现力，但需要长时间解决时间。结合了数据驱动方法的求解器启发式方法的最新工作表明，有可能克服此问题，从而可以在更大规模的实际问题上进行应用。为了通过数据驱动的方法在线求解混合企业双线性程序，存在几种配方，包括具有互补约束（MPCC），混合智能编程（MIP）的数学编程。在这项工作中，我们将这些数据驱动方案的性能基于具有离散模式开关和避免碰撞限制的书架组织问题的性能。将成功率，最佳成本和解决时间与非DATA驱动方法进行比较。我们提出的方法被证明是用于书架问题的机器人臂的高级计划者。

将包装从存储设施运送到消费者前门的物流通常采用高度专业的机器人，通常会将子任务分配到不同的系统，例如，操纵器臂进行分类和轮式车辆进行交付。最近的努力试图通过腿部和人形机器人进行统一的方法。但是，这些解决方案占据了大量空间，从而减少了可以适合运送车辆的包装数量。结果，这些庞大的机器人系统通常会降低可伸缩性和并行任务的潜力。在本文中，我们介绍了Limms（锁存智能模块化移动系统），以解决典型的最后一英里交付的操纵和交付部分，同时保持最小的空间足迹。 Limms是一种对称设计的，6型自由度（DOF）的类似于附件的机器人，两端都带有轮子和闩锁机构。通过将锁在表面上并锚定在一端，Limms可以充当传统的6多型操纵器臂。另一方面，多个lims可以锁在一个盒子上，并且像腿部机器人系统一样行为，包装是身体。在运输过程中，与传统的机器人系统相比，LIMM紧紧地折叠起来，占用的空间要少得多。一大批limms单元可以安装在单个送货工具内部，为新的交付优化和混合计划方法开放，从未做过。在本文中，使用硬件原型研究和呈现了LIMM的可行性，以及在典型的最后一英里交付中的一系列子任务的仿真结果。

在本文中，我们为LIMM介绍了一个运动计划者，该计划者是一个模块化的多模式包装输送平台。单个limms单元是一个机器人，它可以作为手臂或腿部操作，具体取决于它的附加方式和内容，例如，当操纵器固定在送货车内的墙壁上时，或将4个附加在盒子附加到盒子的墙壁上时。当每个限制的角色都可以扮演截然不同的角色时，在多个lim上进行协调，很快就会变得复杂。对于这样一个计划问题，我们首先构成了必要的逻辑和约束。然后，该公式将用于技能探索，并可以在精炼后在硬件上实现。为了解决此优化问题，我们使用乘数的交替方向方法（ADMM）。在各种情况下，对拟议的规划师进行了实验，该计划显示了LIMMS进入不同模式或组合的能力，以实现其移动运输箱的目标。

信号处理是几乎任何传感器系统的基本组件，具有不同科学学科的广泛应用。时间序列数据，图像和视频序列包括可以增强和分析信息提取和量化的代表性形式的信号。人工智能和机器学习的最近进步正在转向智能，数据驱动，信号处理的研究。该路线图呈现了最先进的方法和应用程序的关键概述，旨在突出未来的挑战和对下一代测量系统的研究机会。它涵盖了广泛的主题，从基础到工业研究，以简明的主题部分组织，反映了每个研究领域的当前和未来发展的趋势和影响。此外，它为研究人员和资助机构提供了识别新前景的指导。

Non-linear state-space models, also known as general hidden Markov models, are ubiquitous in statistical machine learning, being the most classical generative models for serial data and sequences in general. The particle-based, rapid incremental smoother PaRIS is a sequential Monte Carlo (SMC) technique allowing for efficient online approximation of expectations of additive functionals under the smoothing distribution in these models. Such expectations appear naturally in several learning contexts, such as likelihood estimation (MLE) and Markov score climbing (MSC). PARIS has linear computational complexity, limited memory requirements and comes with non-asymptotic bounds, convergence results and stability guarantees. Still, being based on self-normalised importance sampling, the PaRIS estimator is biased. Our first contribution is to design a novel additive smoothing algorithm, the Parisian particle Gibbs PPG sampler, which can be viewed as a PaRIS algorithm driven by conditional SMC moves, resulting in bias-reduced estimates of the targeted quantities. We substantiate the PPG algorithm with theoretical results, including new bounds on bias and variance as well as deviation inequalities. Our second contribution is to apply PPG in a learning framework, covering MLE and MSC as special examples. In this context, we establish, under standard assumptions, non-asymptotic bounds highlighting the value of bias reduction and the implicit Rao--Blackwellization of PPG. These are the first non-asymptotic results of this kind in this setting. We illustrate our theoretical results with numerical experiments supporting our claims.

Numerous works use word embedding-based metrics to quantify societal biases and stereotypes in texts. Recent studies have found that word embeddings can capture semantic similarity but may be affected by word frequency. In this work we study the effect of frequency when measuring female vs. male gender bias with word embedding-based bias quantification methods. We find that Skip-gram with negative sampling and GloVe tend to detect male bias in high frequency words, while GloVe tends to return female bias in low frequency words. We show these behaviors still exist when words are randomly shuffled. This proves that the frequency-based effect observed in unshuffled corpora stems from properties of the metric rather than from word associations. The effect is spurious and problematic since bias metrics should depend exclusively on word co-occurrences and not individual word frequencies. Finally, we compare these results with the ones obtained with an alternative metric based on Pointwise Mutual Information. We find that this metric does not show a clear dependence on frequency, even though it is slightly skewed towards male bias across all frequencies.

While the brain connectivity network can inform the understanding and diagnosis of developmental dyslexia, its cause-effect relationships have not yet enough been examined. Employing electroencephalography signals and band-limited white noise stimulus at 4.8 Hz (prosodic-syllabic frequency), we measure the phase Granger causalities among channels to identify differences between dyslexic learners and controls, thereby proposing a method to calculate directional connectivity. As causal relationships run in both directions, we explore three scenarios, namely channels' activity as sources, as sinks, and in total. Our proposed method can be used for both classification and exploratory analysis. In all scenarios, we find confirmation of the established right-lateralized Theta sampling network anomaly, in line with the temporal sampling framework's assumption of oscillatory differences in the Theta and Gamma bands. Further, we show that this anomaly primarily occurs in the causal relationships of channels acting as sinks, where it is significantly more pronounced than when only total activity is observed. In the sink scenario, our classifier obtains 0.84 and 0.88 accuracy and 0.87 and 0.93 AUC for the Theta and Gamma bands, respectively.

This is paper for the smooth function approximation by neural networks (NN). Mathematical or physical functions can be replaced by NN models through regression. In this study, we get NNs that generate highly accurate and highly smooth function, which only comprised of a few weight parameters, through discussing a few topics about regression. First, we reinterpret inside of NNs for regression; consequently, we propose a new activation function--integrated sigmoid linear unit (ISLU). Then special charateristics of metadata for regression, which is different from other data like image or sound, is discussed for improving the performance of neural networks. Finally, the one of a simple hierarchical NN that generate models substituting mathematical function is presented, and the new batch concept ``meta-batch" which improves the performance of NN several times more is introduced. The new activation function, meta-batch method, features of numerical data, meta-augmentation with metaparameters, and a structure of NN generating a compact multi-layer perceptron(MLP) are essential in this study.

We present a novel dataset named as HPointLoc, specially designed for exploring capabilities of visual place recognition in indoor environment and loop detection in simultaneous localization and mapping. The loop detection sub-task is especially relevant when a robot with an on-board RGB-D camera can drive past the same place (``Point") at different angles. The dataset is based on the popular Habitat simulator, in which it is possible to generate photorealistic indoor scenes using both own sensor data and open datasets, such as Matterport3D. To study the main stages of solving the place recognition problem on the HPointLoc dataset, we proposed a new modular approach named as PNTR. It first performs an image retrieval with the Patch-NetVLAD method, then extracts keypoints and matches them using R2D2, LoFTR or SuperPoint with SuperGlue, and finally performs a camera pose optimization step with TEASER++. Such a solution to the place recognition problem has not been previously studied in existing publications. The PNTR approach has shown the best quality metrics on the HPointLoc dataset and has a high potential for real use in localization systems for unmanned vehicles. The proposed dataset and framework are publicly available: https://github.com/metra4ok/HPointLoc.

In the Earth's magnetosphere, there are fewer than a dozen dedicated probes beyond low-Earth orbit making in-situ observations at any given time. As a result, we poorly understand its global structure and evolution, the mechanisms of its main activity processes, magnetic storms, and substorms. New Artificial Intelligence (AI) methods, including machine learning, data mining, and data assimilation, as well as new AI-enabled missions will need to be developed to meet this Sparse Data challenge.